A Sheffer-Criterion for Partial 4-Valued Logic

نویسنده

  • Karsten Schölzel
چکیده

We determine the minimal covering of maximal partial clones in 4-valued logic. That means a necessary and sufficient condition for partial Sheffer functions in 4-valued logic in terms of the maximal partial clones is established. Furthermore several statements about members of the minimal covering of the maximal partial clones for any finite-valued logic are established.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification of Functions and Enumeration of Bases of Set Logic under Boolean Compositions

A small fraction of these functions are Boolean functions (including constants), that is functions that can be This paper discusses some classification and constructed from constants and variables, using union, The set p(r) is a enumeration problems in r-valued set logic, which is the intersection and complementation. logic of functions mapping n-tuples of subsets into subsets Boolean algebra (...

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

χChek: A Model Checker for Multi-Valued Reasoning

This paper describes our multi-valued symbolic modelchecker χChek. χChek is a generalization of an existing symbolic model-checking algorithm for a multi-valued extension of the temporal logic CTL. Multi-valued modelchecking supports reasoning with values other than just TRUE and FALSE. Multi-valued logics are useful in software engineering because they support explicit modeling of uncertainty,...

متن کامل

\chiChek: A Model Checker for Multi-Valued Reasoning

This paper describes our multi-valued symbolic modelchecker χChek. χChek is a generalization of an existing symbolic model-checking algorithm for a multi-valued extension of the temporal logic CTL. Multi-valued modelchecking supports reasoning with values other than just TRUE and FALSE. Multi-valued logics are useful in software engineering because they support explicit modeling of uncertainty,...

متن کامل

Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Multiple-Valued Logic and Soft Computing

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2012